Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
نویسندگان
چکیده
منابع مشابه
Stochastic Online Scheduling on Parallel Machines
We propose a model for non-preemptive scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to the traditional stochastic scheduling models, we assume that jobs arrive online over time, and there is no knowledge about the jobs that will a...
متن کاملScheduling on Uniform Nonsimultaneous Parallel Machines
We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time. We give a variant of the Multifit algorithm which generates schedules which end within 1.382 times the optimal maximum completion time for the general problem, and within √ 6/2 times the optimal maximum completion time for proble...
متن کاملStochastic Online Scheduling on Unrelated Machines
We derive the first performance guarantees for a combinatorial online algorithm that schedules stochastic, nonpreemptive jobs on unrelated machines to minimize the expectation of the total weighted completion time. Prior work on unrelated machine scheduling with stochastic jobs was restricted to the offline case, and required sophisticated linear or convex programming relaxations for the assign...
متن کاملOnline Preemptive Scheduling on Parallel Machines
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 ≥ s 2 ≥. .. ≥ s m and a sequence of jobs, each described by its processing time (length). The actual time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several piec...
متن کاملTwo semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: 0305-0548
DOI: 10.1016/j.cor.2020.105093